Hybridizing Beam Search with Tabu Search for the Irregular Packing Problem
نویسندگان
چکیده
منابع مشابه
A beam search implementation for the irregular shape packing problem
The paper investigates the irregular shape packing problem, also frequently referred to as the nesting problem. A review of the literature highlights two distinct approaches for representing the problem; as an order list of pieces to be packed that is decoded by a placement rule (construction heuristic), or as a layout where pieces have allocated coordinate positions on the stock sheet. The for...
متن کاملProbabilistic Tabu Search with Exponential Neighborhood for Bin Packing Problem
The one-dimensional bin packing problem is defined as follows [2]. Given a finite set I = {1, . . . , n} of items and two constants c and m. Each item has a positive weight wi > 0. Is it possible to partition the set I into m subsets such that the total weight of items in each subset doesn’t exceed c? This decision problem is NP-complete in strong sense and closely related to the following sche...
متن کاملA Hybrid Genetic Algorithms and Tabu Search for Solving an Irregular Shape Strip Packing Problem
This paper presents a packing algorithm to solve an irregular shape strip packing problem. The polygons are packed in strip material, which limits a bin width but not limits a bin length. The objective of a packing algorithm is to minimize a bin length. This paper proposes a hybrid method of genetic algorithms and tabu search to solve a packing problem. Initially, a hybrid method behaves like r...
متن کاملA guided local search based on a fast neighborhood search for the irregular strip packing problem
The irregular strip packing problem asks to place a set of polygons within a rectangular strip of fixed height without overlap, so as to minimize the strip width required. We consider an overlap minimization problem which minimizes the amount of overlap penalty for all pairs of polygons within a given bound of strip width. We propose a local search algorithm which translates a polygon in horizo...
متن کاملAPPLICATION OF TABU SEARCH FOR SOLVING THE BI-OBJECTIVE WAREHOUSE PROBLEM IN A FUZZY ENVIRONMENT
The bi-objective warehouse problem in a crisp environment is often not eective in dealing with the imprecision or vagueness in the values of the problem parameters. To deal with such situations, several researchers have proposed that the parameters be represented as fuzzy numbers. We describe a new algorithm for fuzzy bi-objective warehouse problem using a ranking function followed by an applic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Problems in Engineering
سال: 2021
ISSN: 1563-5147,1024-123X
DOI: 10.1155/2021/5054916